Analyzing Packet Interarrival Times Distribution to Detect Network Bottlenecks

نویسنده

  • Pál Varga
چکیده

This paper analyzes the properties of packet interarrival time (PIT) distribution fimctions of network segments including bottlenecks. In order to show the correlation between bottleneck behavior and packet interarrival time distribution, the alteration of probability distribution f~~nc t ion (PDF) is observed through simulations including tighter and tighter bottleneck connections. The process of network bottleneck detection by passive monitoring requires effective metrics for distinguishing seriously congested links from normal or underutilized connections. The paper evaluates the third and fourth central moments (skewness and kurtosis, respectively) of PIT distribution as possible metrics for bottleneck detection. Simulation results as well as real measurement data analysis showed that PIT kurtosis can be a powerful measure of bottleneck behavior.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Detection of Stepping-stone Attacks

The detection of encrypted stepping-stone attack is considered. Besides encryption and padding, the attacker is capable of inserting chaff packets and perturbing packet timing and transmission order. Based on the assumption that packet arrivals form renewal processes, and a pair of such renewal processes is also renewal, a nonparametric detector is proposed to detect attacking traffic by testin...

متن کامل

Detection of Covert Channel Encoding in Network Packet Delays

Covert channels are mechanisms for communicating information in ways that are difficult to detect. Data exfiltration can be an indication that a computer has been compromised by an attacker even when other intrusion detection schemes have failed to detect a successful attack. Covert timing channels use packet interarrival times, not header or payload embedded information, to encode covert messa...

متن کامل

Random multiple access of broadcast channels with Pareto distributed packet interarrival times

We consider the random multiple access of a slotted broadcast communication channel. Packet arrivals for such channels are often modeled as Poisson processes because the latter have attractive theoretical properties and are well understood, even though a number of traac studies have shown that packet interarrival times are not always exponentially distributed. For example, recent studies argue ...

متن کامل

A : Elements of Queueing Theory

APPENDIX A: ELEMENTS OF QUEUEING THEORY In a packet radio network, packets/messages are forwarded from node to node through the network by entering a buffer (queue) of a certain length in each node and waiting for their turn to be transmitted to the next node. Also, call access to a network with a given capacity is modeled as a process with certain distribution of call arrival times and certain...

متن کامل

On Effectiveness of Link Padding for Statistical Traffic Analysis Attacks

Traffic analysis attacks aim at deriving mission critical information from the analysis of the traffic transmitted over a network. Countermeasures for such attacks are usually realized by properly “padding” the payload traffic so that the statistics of the overall traffic become significantly different from that of the payload traffic. In this paper, we propose a analytical framework for traffi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005